AN IMPROVED LOWER BOUND FOR SCHWARZ LEMMA AT THE BOUNDARY
نویسندگان
چکیده
منابع مشابه
An improved bound for the stepping-up lemma
The partition relation N → (n) l means that whenever the k-tuples of an N -element set are lcolored, there is a monochromatic set of size n, where a set is called monochromatic if all its k-tuples have the same color. The logical negation of N → (n) l is written as N 6→ (n) l . An ingenious construction of Erdős and Hajnal known as the stepping-up lemma gives a negative partition relation for h...
متن کاملAn improved probability bound for the Approximate S-Lemma
The purpose of this note is to give a probability bound on symmetric matrices to improve an error bound in the Approximate S-Lemma used in establishing levels of conservatism results for approximate robust counterparts. © 2007 Elsevier B.V. All rights reserved.
متن کاملAn Improved lower bound for arithmetic regularity
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemeredi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ≤ G of bounded index such that, when restricted to most cosets of H, the function f is pseudorandom in the sense that all its nontrivial Fourier coefficients are ...
متن کاملAn improved lower bound for (1,
We call a subset C of vertices of a graph G a (1,≤ l)-identifying code if for all subsets X of vertices with size at most l, the sets {c ∈ C|∃u ∈ X, d(u, c) ≤ 1} are distinct. The concept of identifying codes was introduced in 1998 by Karpovsky, Chakrabarty and Levitin. Identifying codes have been studied in various grids. In particular, it has been shown that there exists a (1,≤ 2)-identifying...
متن کاملAn Improved Lower Bound for Approximating CVP
This paper shows the problem of nding the closest vector in an n-dimensional lattice to be NP-hard to approximate to within factor n c= log log n for some constant c > 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Pure and Applied Mathematics
سال: 2016
ISSN: 1226-0657
DOI: 10.7468/jksmeb.2016.23.1.61